Adding Metatheoretic Facilities to Rst-order Theories

نویسندگان

  • David Basin
  • See An Matthews
چکیده

Generic proof systems like Isabelle provide some limited but useful metatheoretic facilities for declared logics; in particular, users can prove simple derived rules and alsòsolve' formulae that contain meta-variables | a technique useful for, e.g., program synthesis. We show how an arbitrary rst order theory can be conservatively extended to provide similar facilities, without a supporting metatheory, and examine what the limitations of this approach are.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adding Metatheoretic Facilities to First-Order Theories

Generic proof systems like Isabelle provide some limited but useful metatheoretic facilities for declared logics; in particular, users can prove simple derived rules and alsòsolve' formulae that contain metavariables | a technique useful for, e.g., program synthesis. We show how an arbitrary rst order theory can be conservatively extended to provide similar facilities, without a supporting meta...

متن کامل

Computing Belief Revision

This paper introduces a belief revision system on a foundational basis which uses epistemic entrenchment to guide its decisions in the face of connict. The formalism satisses the AGM postulates for belief revision and thus combines foundational and coherence approaches. The belief revision system is based on a metatheoretic treatment of rst-order logic and treats expansions and contractions as ...

متن کامل

Theories for Mechanical Proofs of ImperativeProgramsWim

For convenient application of a rst{order theorem prover to veri-cation of imperative programs, it is important to encapsulate the operational semantics in generic theories. The possibility to do so is illustrated by two theories for the Boyer{Moore theorem prover Nqthm. The rst theory is an Nqthm version of the classical while{theorem. Here the main interest is to show how one can use Nqthm's ...

متن کامل

General Domain Circumscription in its First-Order Reduction

We rst de ne general domain circumscription GDC and provide it with a semantics GDC subsumes existing domain circumscrip tion proposals in that it allows varying of arbitrary predicates functions or constants to maximize the minimization of the domain of a theory We then show that for the class of semi universal theories without func tion symbols that the domain circumscription of such theories...

متن کامل

General Domain Circumscription and its Effective Reductions

We rst deene general domain circumscription (GDC) and provide it with a semantics. GDC subsumes existing domain circumscription proposals in that it allows varying of arbitrary predicates, functions, or constants, to maximize the minimization of the domain of a theory. We then show that for the class of semi-universal theories without function symbols, that the domain circumscription of such th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995